A HOL Embedding of a Small Parallel HDL

نویسندگان

  • Mats Larsson
  • Andrew D. Gordon
چکیده

This paper reports work-in-progress on the embedding of a small hardware description language in HOL. Our language is a subset of ADDL, a language used to write design speciications for the CAMAD synthesis tool developed in Linkk oping. Our intention is to mechanise transformational reasoning about ADDL programs as theorem-proving in HOL. Our work extends Camilleri and Melham's deep embedding of a WHILE-language and its evaluation semantics in HOL; the main extensions needed to model ADDL are multi-dimensional arrays and parallel composition of commands. It is important to include such features as they are used in practice with ADDL.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning on Data-Parallel Programs in Isabelle/HOL

This paper describes a dialect of the programming language C for data-parallel applications and its embedding into a verification environment based on Isabelle/HOL. On the one hand, the proposed language eliminates C features that interfere with program verification, while on the other hand, it introduces means to express data-parallelism. The embedding of this language into the existing verifi...

متن کامل

Hybrid verification integrating HOL theorem proving with MDG model checking

In this paper, we describe a hybrid tool for hardware formal verification that links the HOL (higher-order logic) theorem prover and the MDG (multiway decision graphs) model checker. Our tool supports abstract datatypes and uninterpreted function symbols available in MDG, allowing the verification of high-level specifications. The hybrid tool, HOL–MDG, is based on an embedding in HOL of the gra...

متن کامل

Embedding a Formal Notation: Experiences of Automating the Embedding of Z in the Higher Order Logics of Pvs and Hol Embedding a Formal Notation: Experiences of Automating the Embedding of Z in the Higher Order Logics of Pvs and Hol

In this paper, we consider the problem of embedding formal notations. In particular, we describe our experiences of automating the embedding of Z speciications into the notations of the PVS and HOL theorem provers. This paper is motivated by our experiences of constructing a prototype tool for embedding formal notations and its use in automating an embedding of Z and AMN into the notations of P...

متن کامل

Phishing website detection using weighted feature line embedding

The aim of phishing is tracing the users' s private information without their permission by designing a new website which mimics the trusted website. The specialists of information technology do not agree on a unique definition for the discriminative features that characterizes the phishing websites. Therefore, the number of reliable training samples in phishing detection problems is limited. M...

متن کامل

A Deep Embedding of a Decidable Fragment of Separation Logic in HOL

Smallfoot is a tool to automatically check separation logic specifications of sequential programs. It uses a decidable fragment of separation logic. In this paper, a deep embedding of a slightly different decidable fragment of separation logic inspired by Smallfoot is presented. Moreover, a HOL implementation of a decision procedure for entailments in this logic is described. The main focus of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007